Lecture 4: Covering the Large Spectrum via Dual-sparse Approximation

نویسنده

  • James R. Lee
چکیده

1 Discrete Fourier analysis In this lecture, we use the dual-sparse approximation theorem from the last lecture to prove some results in discrete Fourier analysis. For simplicity, we restrict ourselves to the setting of G ¿ n 2 , but the theorems hold (when suitably restated) for any finite abelian group G. Fourier analysis over ¿ n 2. We use ¿ 2 {0, 1} to denote the field on two elements. Let G ¿ n 2 be equipped with the uniform measure µ. We usê G ¿ n 2 to denote the dual group (though we use the notations G andˆG to distinguish primal and dual objects). We will use the definitions from Lecture 3 (Section 3).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lanczos-type Solvers for Non-hermitian Linear Systems

In this overview we discuss iterative methods for solving large linear systems with sparse (or, possibly, structured) nonsymmetric (or, non-Hermitian) matrix that are based on the Lanczos process. They feature short recurrences for the generation of the Krylov space and for the sequence of approximations to the solution. This means low cost and low memory requirement. For very large sparse non-...

متن کامل

Large-scale Inversion of Magnetic Data Using Golub-Kahan Bidiagonalization with Truncated Generalized Cross Validation for Regularization Parameter Estimation

In this paper a fast method for large-scale sparse inversion of magnetic data is considered. The L1-norm stabilizer is used to generate models with sharp and distinct interfaces. To deal with the non-linearity introduced by the L1-norm, a model-space iteratively reweighted least squares algorithm is used. The original model matrix is factorized using the Golub-Kahan bidiagonalization that proje...

متن کامل

A New Dictionary Construction Method in Sparse Representation Techniques for Target Detection in Hyperspectral Imagery

Hyperspectral data in Remote Sensing which have been gathered with efficient spectral resolution (about 10 nanometer) contain a plethora of spectral bands (roughly 200 bands). Since precious information about the spectral features of target materials can be extracted from these data, they have been used exclusively in hyperspectral target detection. One of the problem associated with the detect...

متن کامل

CSC 2420 - Fall 2010 - Lecture 5

In the previous lecture we developed an LP formulation for the f -frequency weighted set cover problem and further noted that the weighted vertex cover problem is a case of 2-frequency covering problem. We also considered a greedy algorithm for the set cover problem and claimed that it has an approximation ratio of Hd. This claim is proved in this class using the dual fitting analysis. 1 Weight...

متن کامل

@bullet Approximation Schemes for Multicommodity Flow Problems 1 Multicommodity Flow Problem

In this lecture, we will present a general primal-dual approach for solving multicommodity flow problems. This technique could also be viewed as a Lagrangian relaxation approach, which is widely used in optimization, and can also been seen to be similar to the exponential weight method used in online learning and other algorithms. The approach we present extends to more general packing/covering...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016